Pseudo-uniform Convexity in Hp and Some Extremal Problems on Sobolev Spaces
نویسندگان
چکیده
منابع مشابه
global results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
On some extremal problems on r-graphs
Denote by G(r)(n ; k) an r-graph of n vertices and k r-tuples. TurLn’s classical problem states: Determine the smallest integer f(n ;r, I) so that every G(‘)(n ; f (n ; r, I)) contains a K(‘)(I). Turin determined f (n; r, I) for r = 2, but nothing is known for r > 2. Put lim,=., f (n ; r, l)/(y) = cr,l. The values of cr l are not known for r > 2. I prove that to every E > 0 and integer t there ...
متن کاملSome Extremal Problems in Geometry
Continuing our work of [3] we obtain lower bounds on the number of simplices of different volumes and on the number of hyperplanes determined by n points in Ek , not all of which lie on an Ek-1 and no k of which lie on an Ek-2 . We also determine the minimum number of triangles t determined by n noncollinear points in the plane and discuss what values of t can be achieved . L . M . Kelly and 14...
متن کاملcompactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولSOME EXTREMAL PROBLEMS ON r-GRAPHS
1 . Introduction . By an r-graph we mean a fixed set of vertices together with a class of unordered subsets of this fixed set, each subset containing exactly r elements and called an r-tuple . In the language of Berge [2j this is a simple uniform hypergraph of rank r . The concept becomes interesting only for r > 1 : for r = 2 we obtain ordinary (i .e ., Michigan) graphs . We shall represent an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex Variables and Elliptic Equations
سال: 2003
ISSN: 1747-6933
DOI: 10.1080/0278107031000097023